Graph spectra as a systematic tool in computational biology
نویسندگان
چکیده
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or duplication leave characteristic traces in the spectrum. This can suggest hypotheses about the evolution of a graph representing biological data. To this data, we analyze several biological networks in terms of rough qualitative data of their spectra.
منابع مشابه
X-ray spectra calculation for different target-filter of mammograms using MCNP Code
ABSTRACTBackground: An electron beam generated X-ray spectrum consists of characteristic X-ray and continuous bermsstrahlung. The aim of this research is calculating and comparing X-ray spectra for different target filter of mammograms. Materials and Methods: Monte Carlo is a very powerful tool to simulate a series of different target-filter assembly in order to calculate the X-ray spectra. MC...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملPRIGSA: Protein repeat identification by graph spectral analysis
Repetition of a structural motif within protein is associated with a wide range of structural and functional roles. In most cases the repeating units are well conserved at the structural level while at the sequence level, they are mostly undetectable suggesting the need for structure-based methods. Since most known methods require a training dataset, de novo approach is desirable. Here, we prop...
متن کاملTHE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
متن کاملAn Algorithm for an Automatic NOE Pathways Analysis of 2D NMR Spectra of RNA Duplexes
An algorithm is proposed to provide the tool for an automatic resonance assignment of 2D-NOESY spectra of RNA duplexes. The algorithm, based on a certain subproblem of the Hamiltonian path, reduces a number of possible connections between resonances within aromatic and anomeric region of 2D-NOESY spectra. Appropriate pathways between H6/H8 and H1' resonances were obtained by subsequent implemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009